- error bound
- межа похибки

*Англійсько-український словник авіаційних термінів / Уклад.: Р.О. Гільченко. - К.: НАУ.
2009.*

- error bound
- межа похибки

*Англійсько-український словник авіаційних термінів / Уклад.: Р.О. Гільченко. - К.: НАУ.
2009.*

**Error exponent**— In information theory, the error exponent of a channel code or source code over the block length of the code is the logarithm of the error probability. For example, if the probability of error of a decoder drops as e – n α, where n is the block… … Wikipedia**Error detection and correction**— In mathematics, computer science, telecommunication, and information theory, error detection and correction has great practical importance in maintaining data (information) integrity across noisy channels and less than reliable storage… … Wikipedia**Cramér–Rao bound**— In estimation theory and statistics, the Cramér–Rao bound (CRB) or Cramér–Rao lower bound (CRLB), named in honor of Harald Cramér and Calyampudi Radhakrishna Rao who were among the first to derive it,[1][2][3] expresses a lower bound on the… … Wikipedia**Chernoff bound**— In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… … Wikipedia**Technique for Human Error Rate Prediction**— (THERP) is a technique used in the field of Human reliability Assessment (HRA), for the purposes of evaluating the probability of a human error occurring throughout the completion of a specific task. From such analyses measures can then be taken… … Wikipedia**Johnson bound**— The Johnson bound is a bound on the size of error correcting codes.Let C be a q ary code of length n, i.e. a subset of mathbb{F} q^n. Let d be the minimum distance of C, i.e. :d = min {x,y in C, x eq y} d(x,y) where d(x,y) is the Hamming distance … Wikipedia**Concatenated error correction code**— In coding theory, concatenated codes form a class of error correcting codes that are derived by combining an inner code and an outer code. They were conceived in 1966 by Dave Forney as a solution to the problem of finding a code that has both… … Wikipedia**Hamming bound**— In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere packing bound or the volume bound from an interpretation in terms of… … Wikipedia**Margin of error**— This article is about the statistical precision of estimates from sample surveys. For safety margins in engineering, see Factor of safety. For tolerance in engineering, see Tolerance (engineering). Not to be confused with Margin for Error. The… … Wikipedia**Branch and bound**— (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia**Quantum error correction**— is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault tolerant quantum computation that can deal not only with noise on … Wikipedia